Probabilistic Games
ثبت نشده
چکیده
Assume we have the following game. A verifier V interacts with two provers P1 and P2. The verifier is probabilistic and acts honestly according to its (known) strategy. The goal of the provers is to convince the verifier of a certain fact. The provers may collaborate to set up a strategy to maximize their chances of success. However, they are not allowed to exchange information once they received their respective question from the verifier.
منابع مشابه
Gist: A Solver for Probabilistic Games
Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-base...
متن کاملA Probabilistic Representation of Exact Games on σ-Algebras
The purpose of this paper is to establish the intrinsic relations between the cores of exact games on σ-algebras and the extensions of exact games to function spaces. Given a probability space, exact functionals are defined on L∞ as an extension of exact games. To derive a probabilistic representation for exact functionals, we endow them with two probabilistic conditions: law invariance and the...
متن کاملDistributed Probabilistic and Quantum Strategies
Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat strategies as identities. A higher-order probabilistic process language reminiscent of Milner’s CCS is interpretable within probabilistic strategies. W.r.t. a new ...
متن کاملDistributed Probabilistic Strategies
Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat strategies as identities. A higher-order probabilistic process language reminiscent of Milner’s CCS is interpreted within probabilistic strategies. W.r.t. a new de...
متن کاملTrading Probability for Fairness
Behavioral properties of open systems can be formalized as objectives in two-player games. Turn-based games model asynchronous interaction between the players (the system and its environment) by interleaving their moves. Concurrent games model synchronous interaction: the players always move simultaneously. Infinitary winning criteria are considered: Büchi, co-Büchi, and more general parity con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005